Continuant polynomials and worst-case behavior of Hopcroft’s minimization algorithm
نویسندگان
چکیده
منابع مشابه
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
This paper is concernedwith the analysis of theworst case behavior of Hopcroft’s algorithm for minimizing deterministic finite state automata. We extend a result of Castiglione, Restivo and Sciortino. They show that Hopcroft’s algorithm has a worst case behavior for the automata recognizing Fibonacci words. In a previous paper, we have proved that this holds for all standard Sturmian words havi...
متن کاملWhat is the Worst Case Behavior of the Simplex Algorithm?
The examples published by Klee and Minty in 1972 do not preclude the existence of a pivot rule which will make the simplex method, at worst, polynomial. In fact, the continuing success of Dantzig's method suggests that such a rule does exist. A study of known examples shows that (a) those which use selective pivot rules require exponentially large coe cients, and (b) none of the examples' pivot...
متن کاملA New Algorithm and Worst Case
We study algorithms for approximation of Feynman-Kac path integrals in the worst case setting. The algorithms use a nite number of samples of the initial condition and potential functions. We present a new algorithm and an explicit bound on its cost to compute an "-approximation to the Feynman-Kac path integral. We also establish bounds on the worst case complexity of Feynman-Kac path integrati...
متن کاملThe Worst Case Behavior of Randomized Gossip
This paper considers the quasi-random rumor spreading model introduced by Doerr, Friedrich, and Sauerwald in [SODA 2008], hereafter referred to as the list-based model. Each node is provided with a cyclic list of all its neighbors, chooses a random position in its list, and from then on calls its neighbors in the order of the list. This model is known to perform asymptotically at least as well ...
متن کاملLeapfrog Constructions: From Continuant Polynomials to Permanents of Matrices
We study noncommutative continuant polynomials via a new leapfrog construction. This needs the introduction of new indeterminates and leads to generalizations of Fibonacci polynomials, Lucas polynomials and other families of polynomials. We relate these polynomials to various topics such as quiver algebras and tilings. Finally, we use permanents to give a broad perspective on the subject.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.01.039